Approximate counting of regular hypergraphs
نویسندگان
چکیده
In this paper we asymptotically count d-regular k-uniform hypergraphs on n vertices, provided k is fixed and d = d(n) = o(n). In doing so, we extend to hypergraphs a switching technique of McKay and Wormald.
منابع مشابه
Regular Partitions of Hypergraphs: Counting Lemmas
We continue the study of regular partitions of hypergraphs. In particular we obtain corresponding counting lemmas for the regularity lemmas for hypergraphs from [Regular partitions of hypergraphs: Regularity Lemmas, Combin. Probab. Comput., to appear].
متن کاملCounting Hypergraph Matchings up to Uniqueness Threshold
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter λ, each matching M is assigned a weight λ|M |. The counting problem is formulated as computing a partition function that gives the sum of the weights of all matchings in a hypergraph. This problem unifies two extensively studied statistical...
متن کاملApproximate Counting of Matchings in (3, 3)-Hypergraphs
We design a fully polynomial time approximation scheme (FPTAS) for counting the number of matchings (packings) in arbitrary 3-uniform hypergraphs of maximum degree three, referred to as (3, 3)hypergraphs. It is the first polynomial time approximation scheme for that problem, which includes also, as a special case, the 3D Matching counting problem for 3-partite (3, 3)-hypergraphs. The proof tech...
متن کاملApproximate Counting of Matchings in Sparse Uniform Hypergraphs
In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of matchings in k-uniform hypergraphs whose intersection graphs contain few claws. Our method gives a generalization of the canonical path method of Jerrum and Sinclair to hypergraphs satisfying a local restriction. Our proof method depends on an application of the Euler tour technique for the canoni...
متن کاملRegular Hypergraphs: Asymptotic Counting and Loose Hamilton Cycles
We present results from two papers by the authors on analysis of d-regular k-uniform hypergraphs, when k is fixed and the number n of vertices tends to infinity. The first result is approximate enumeration of such hypergraphs, provided d = d(n) = o(nκ), where κ = κ(k) = 1 for all k ≥ 4, while κ(3) = 1/2. The second result is that a random d-regular hypergraph contains as a dense subgraph the un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 113 شماره
صفحات -
تاریخ انتشار 2013